Binomial vanishing ideals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binomial vanishing ideals

In this note we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K. 2010 MSC: 13F20, 13C05, 14H45

متن کامل

Binomial Ideals

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and it has numerous applications within and beyond pure mathematics. The ideals defining toric varieties are precisely the binomial prime ideals. Our main result...

متن کامل

Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals

It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...

متن کامل

Binomial Difference Ideals

In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Gröbner basis of Z[x]-lattices, regular and coherent difference ascending chains, and partial characters over Z[x]-lattices, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, and perfect a...

متن کامل

Decompositions of Binomial Ideals

A binomial ideal in a polynomial ring is an ideal which can be generated by binomials. We present Binomials, a package for the computer algebra system Macaulay 2 (Eisenbud et al (2001)), which specializes well known algorithms to binomial ideals, allowing for a significant speedup of common computations like primary decomposition. Central parts of the implemented algorithms go back to the found...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications

سال: 2015

ISSN: 2148-838X

DOI: 10.13069/jacodesmath.12847